Search results for "Span tree"

showing 1 items of 1 documents

Biased Modern Heuristics for the OCST Problem

2011

Biasing modern heuristics is an appropriate possibility in designing problem-specific and high-quality modern heuristics. If we have knowledge about a problem we can bias the design elements of modern heuristics, namely the representation and search operator, fitness function, the initial solution, or even the search strategy. This chapter presents a case study on how the performance of modern heuristics can be increased by biasing the design elements towards high-quality solutions. Results show that problem-specific and biased modern heuristics outperform standard variants and even for large problem instances high-quality solutions can be found.

Mathematical optimizationFitness functionOperator (computer programming)Computer scienceSimulated annealingGenetic algorithmDesign elements and principlesRepresentation (mathematics)HeuristicsSpan tree
researchProduct